Minimal and Canonical Images
نویسندگان
چکیده
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the group, to efficiently reduce the amount of search which must be performed to find a canonical image. We present both a formal proof of correctness of our algorithms and experiments on different permutation groups, which compare our algorithms with the previous state of the art.
منابع مشابه
Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کاملCanonical thermostatics of ideal gas in the frame work of generalized uncertainty principle
The statistical consequences of minimal length supposition are investigated for a canonical ensemble of ideal gas. These effects are encoded in the so-called Generalized Uncertainty Principle (GUP) of the second order. In the frame work of the considered GUP scenario, a unique partition function is obtained by using of two different methods of quantum and classical approaches. It should be noti...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملMinimal canonical comprehensive Gröbner systems
This is the continuation of Montes’ paper ‘‘On the canonical discussion of polynomial systems with parameters’’. In this paper, we define the Minimal Canonical Comprehensive Gröbner System of a parametric ideal and fix under which hypothesis it exists and is computable. An algorithm to obtain a canonical description of the segments of the Minimal Canonical CGS is given, thus completing the whol...
متن کاملThe Canonical Metric for Vector Quantization
To measure the quality of a set of vector quantization points a means of measuring the distance between two points is required. Common metrics such as the Hamming and Euclidean metrics, while mathematically simple, are inappropriate for comparing speech signals or images. In this paper it is argued that there often exists a natural environment of functions to the quantizationprocess (for exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1703.00197 شماره
صفحات -
تاریخ انتشار 2017